Cellular automata and finite groups

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Isomorphisms of Additive Cellular Automata on Finite Groups

We study sources of isomorphisms of additive cellular automata on finite groups (called index-group). It is shown that many isomorphisms (called regular) of automata are reducible to the isomorphisms of underlying algebraic structures (such as the index-group, monoid of automata rules, and its subgroup of reversible elements). However for some groups there exist not regular automata isomorphism...

متن کامل

Linear Cellular Automata and Finite Automata

Linear cellular automata have a canonical representation in terms of labeled de Bruijn graphs. We will show that these graphs, construed as semiautomata, provide a natural setting for the study of cellular automata. For example, we give a simple algorithm to determine reversibility and surjectivity of the global maps. We also comment on Wolfram’s question about the growth rates of the minimal f...

متن کامل

Finite Automata Presentable Abelian Groups

We give new examples of FA presentable torsion-free abelian groups. Namely, for every n > 2, we construct a rank n indecomposable torsion-free abelian group which has an FA presentation. We also construct an FA presentation of the group (Z,+) in which every nontrivial cyclic subgroup is not FA recognizable.

متن کامل

Extended finite automata over groups

Some results from Dassow and Mitrana (Internat. J. Comput. Algebra (2000)), Griebach (Theoret. Comput. Sci. 7 (1978) 311) and Ibarra et al. (Theoret. Comput. Sci. 2 (1976) 271) are generalized for finite autómata over arbitrary groups. The closure properties of these autómata are poorer and the accepting power is smaller when abelian groups are considered. We prove that the addition of any abel...

متن کامل

Coxeter Groups and Asynchronous Cellular Automata

The dynamics group of an asynchronous cellular automaton (ACA) relates properties of its long term dynamics to the structure of Coxeter groups. The key mathematical feature connecting these diverse fields is involutions. Group-theoretic results in the latter domain may lead to insight about the dynamics in the former, and vice-versa. In this article, we highlight some central themes and common ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Natural Computing

سال: 2017

ISSN: 1567-7818,1572-9796

DOI: 10.1007/s11047-017-9640-3